monomial irreducible sln-modules
نویسندگان
چکیده
in this article, we introduce monomial irreducible representations of the special linear lie algebra $sln$. we will show that this kind of representations have bases for which the action of the chevalley generators of the lie algebra on the basis elements can be given by a simple formula.
منابع مشابه
Monomial Irreducible sln-Modules
In this article, we introduce monomial irreducible representations of the special linear Lie algebra $sln$. We will show that this kind of representations have bases for which the action of the Chevalley generators of the Lie algebra on the basis elements can be given by a simple formula.
متن کاملGröbner–Shirshov Bases for Irreducible sln+1-Modules
In [10], inspired by an idea of Gröbner, Buchberger discovered an effective algorithm for solving the reduction problem for commutative algebras, which is now called the Gröbner Basis Theory. It was generalized to associative algebras through Bergman’s Diamond Lemma [2], and the parallel theory for Lie algebras was developed by Shirshov [21]. The key ingredient of Shirshov’s theory is the Compo...
متن کاملIrreducible constituents of monomial representations
We describe an algorithm for obtaining the central primitive idempotents of the algebra associated with a monomial representation. As a consequence, we obtain its irreducible constituents. This is implemented in MAGMA, using an algorithm based on Dixon’s modular approach. In the case of permutation representations, we get a simplified version of the algorithms of Michler and Weller. c © 2006 El...
متن کاملCellular Resolutions of Monomial Modules
We construct a canonical free resolution for arbitrary monomial modules and lattice ideals. This includes monomial ideals and defining ideals of toric varieties, and it generalizes our joint results with Irena Peeva for generic ideals [BPS],[PS]. Introduction Given a field k, we consider the Laurent polynomial ring T = k[x 1 , . . . , x ±1 n ] as a module over the polynomial ring S = k[x1, . . ...
متن کاملComputing Irreducible Decomposition of Monomial Ideals
The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic monomial ideals. The second one is an incremental algorithm, which computes decompositions of ideals by adding one generator at a time. Our analysis shows that th...
متن کاملMonomial Cycle Basis on Koszul Homology Modules
It gives a class of p-Borel principal ideals of a polynomial algebra over a field K for which the graded Betti numbers do not depend on the characteristic of K and the Koszul homology modules have monomial cyclic basis. Also it shows that all principal p-Borel ideals have binomial cycle basis on Koszul homology modules.
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
bulletin of the iranian mathematical societyناشر: iranian mathematical society (ims)
ISSN 1017-060X
دوره 37
شماره No. 3 2011
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023